Exploiting Model Variability in ABS to Verify Distributed Algorithms

We show a way to evaluate functional properties of distributed algorithms by the example of the AODV algorithm in sensor networks, Creol and ABS models, and component testing. We present a new method to structure the evaluation work into the categories of techniques, perspectives, arrangements, and properties using executable models. We demonstrate how to use this structure for network simulations and component testing using Creol models and demonstrate how the delta modelling technique of the ABS language can be used to facilitate the approach. Keywords—formal analysis, modelling, model checking, testing, routing algorithms.